Convex Sets in Lexicographic Products of Graphs
نویسندگان
چکیده
Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [4, Theorem 3.1].
منابع مشابه
Convex Polytopes All of Whose Reverse Lexicographic Initial Ideals Are Squarefree
A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a (0, 1)-polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed (0, 1)-polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of p...
متن کاملOn Lexicographic Products of Two Fuzzy Graphs
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملSome Results on [1, k]-sets of Lexicographic Products of Graphs
A subset S ⊆ V in a graph G = (V,E) is called a [1, k]-set, if for every vertex v ∈ V \ S, 1 ≤ |NG(v)∩S| ≤ k. The [1, k]-domination number of G, denoted by γ[1,k](G) is the size of the smallest [1, k]-sets of G. A set S′ ⊆ V (G) is called a total [1, k]-set, if for every vertex v ∈ V , 1 ≤ |NG(v) ∩ S| ≤ k. If a graph G has at least one total [1, k]-set then the cardinality of the smallest such ...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 28 شماره
صفحات -
تاریخ انتشار 2012